#include <stdio.h>
#include <math.h>
using namespace std;

int n, k;

int isprime(int n) {
	for (int i=2; i<=sqrt(n); i++) {
		if (n%i == 0)
			return 0;
	}

	return 1;
}

int sum(int n) {
	int prevPrime=2;
	int prime = 2;
	n--;
	
	while (prevPrime < n/2) {
		prevPrime = prime;

		while (!isprime(++prime));

		if ((prevPrime+prime)==n) { 
			return 1;
		}
	}

	return 0;
}

int verify(int n, int k) {
	int count = 0;
	int prime = 2;	

	while (count < k) {
		if (prime > n)
			return 0;

		while (!isprime(++prime));

		count+=sum(prime);	
	}
}

int main() {
	scanf("%d %d", &n, &k);

	if (verify(n, k)) {
		printf("YES\n");
	} else {
		printf("NO\n");
	}	
	return 0;
}
